Multiobjective Flexible Job Shop Scheduling Using a Modified Invasive Weed Optimization
نویسنده
چکیده
Recently, many studies are carried out with inspirations from ecological phenomena for developing optimization techniques. The new algorithm that is motivated by a common phenomenon in agriculture is colonization of invasive weeds. In this paper, a modified invasive weed optimization (IWO) algorithm is presented for optimization of multiobjective flexible job shop scheduling problems (FJSSPs) with the criteria to minimize the maximum completion time (makespan), the total workload of machines and the workload of the critical machine. IWO is a bio-inspired metaheuristic that mimics the ecological behaviour of weeds in colonizing and finding suitable place for growth and reproduction. IWO is developed to solve continuous optimization problems that’s why the heuristic rule the Smallest Position Value (SPV) is used to convert the continuous position values to the discrete job sequences. The computational experiments show that the proposed algorithm is highly competitive to the state-of-the-art methods in the literature since it is able to find the optimal and best-known solutions on the instances studied.
منابع مشابه
A Modified Invasive Weed Optimization Algorithm for Multiobjective Flexible Job Shop Scheduling Problems
In this paper, a modified invasive weed optimization (IWO) algorithm is presented for optimization of multiobjective flexible job shop scheduling problems (FJSSPs) with the criteria to minimize the maximum completion time (makespan), the total workload of machines and the workload of the critical machine. IWO is a bio-inspired metaheuristic that mimics the ecological behaviour of weeds in colon...
متن کاملMultiobjective Artificial Immune Algorithm for Flexible Job Shop Scheduling Problem
Flexible Job shop scheduling is very important in production management and combinatorial optimization. It is NP-hard problem and consists of two sub-problems: sequencing and assignment. Multiobjective Flexible Job-Shop Scheduling Problems (MFJSSP) is formulated as three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. ...
متن کاملA Particle Swarm Optimization Approach to Joint Location and Scheduling Decisions in A Flexible Job Shop Environment
In traditional scheduling literature, it is generally assumed that the location of facilities are predetermined and fixed in advance. However, these decisions are interrelated and may impact each other significantly. Therefore finding a schedule and facility location has become an important problem as an extension of the well-known scheduling problems. In this research we consider joint decisio...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملFlexible Job Shop Scheduling Using a Multiobjective Memetic Algorithm
This paper addresses the flexible job shop scheduling problem with minimization of the makespan, maximum machine workload, and total machine workload as the objectives. A multiobjective memetic algorithm is proposed. It belongs to the integrated approach, which deals with the routing and sequencing sub-problems together. Dominance-based and aggregation-based fitness assignment methods are used ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015